Partitions with difference conditions and Alder's conjecture.

نویسنده

  • Ae Ja Yee
چکیده

In 1956, Alder conjectured that the number of partitions of n into parts differing by at least d is greater than or equal to that of partitions of n into parts identical with +/-1 (mod d+3) for d > or = 4. In 1971, Andrews proved that the conjecture holds for d = 2r-1, r > or = 4. We sketch a proof of the conjecture for all d > or = 32.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chain enumeration of k-divisible noncrossing partitions of classical types

We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the block size due to Krattenthaler and Müller. We also prove Armstrong’s conjecture on the zeta polynomial of the poset of k-divisible noncrossing partitions of type A invariant under the 180◦ rotation in the cyclic repr...

متن کامل

Resolution of a Conjecture of Andrews and Lewis Involving Cranks of Partitions

In [1] Andrews and Lewis conjecture that the sign of the number of partitions of n with crank congruent to 0 mod 3, minus the number of partitions of n with crank congruent to 1 mod 3 is determined by the congruence class of n mod 3 apart from a finite number of specific exceptions. We prove this by using the “Circle Method” to approximate the value of this difference to great enough accuracy t...

متن کامل

Some difference results on Hayman conjecture and uniqueness

In this paper, we show that for any finite order entire function $f(z)$, the function of the form $f(z)^{n}[f(z+c)-f(z)]^{s}$ has no nonzero finite Picard exceptional value for all nonnegative integers $n, s$ satisfying $ngeq 3$, which can be viewed as a different result on Hayman conjecture. We also obtain some uniqueness theorems for difference polynomials of entire functions sharing one comm...

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

Disproof of a Conjecture by Rademacher on Partial Fractions

In his book Topics in Analytic Number Theory (1973), Hans Rademacher considered the generating function of integer partitions into at most N parts and conjectured certain limits for the coefficients of its partial fraction decomposition. We carry out an asymptotic analysis that disproves this conjecture, thus confirming recent observations of Sills and Zeilberger (Journal of Difference Equation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Proceedings of the National Academy of Sciences of the United States of America

دوره 101 47  شماره 

صفحات  -

تاریخ انتشار 2004